Sum of squares representation for the Böttcher-Wenzel biquadratic form
نویسنده
چکیده
Abstract. We find the minimum scale factor, for which the nonnegative Böttcher-Wenzel biquadratic form becomes a sum of squares (sos). To this we give the primal and dual solutions for the underlying semidefinite program. Moreover, for special matrix classes (tridiagonal, backward tridiagonal and cyclic Hankel matrices) we show that the above form is sos. Finally, we conjecture sos representability for Toeplitz matrices.
منابع مشابه
Piecewise Certificates of Positivity for matrix polynomials
We show that any symmetric positive definite homogeneous matrix polynomial M ∈ R[x1, . . . , xn] admits a piecewise semi-certificate, i.e. a collection of identites M(x) = P j fi,j(x)Ui,j(x) T Ui,j(x) where Ui,j(x) is a matrix polynomial and fi,j(x) is a non negative polynomial on a semialgebraic subset Si, where R = ∪ri=1Si. This result generalizes to the setting of biforms. Some examples of c...
متن کاملOn the real zeros of positive semi-definite biquadratic forms
For a positive semi-definite biquadratic forms F in (3, 3) variables, we prove that if F has a finite number but at least 7 real zeros Z(F ), then it is not a sum of squares. We show also that if F has at least 11 zeros, then it has infinitely many real zeros and it is a sum of squares. It can be seen as the counterpart for biquadratic forms as the results of Choi, Lam and Reznick for positive ...
متن کاملSur Une Classe De Formes Biquadratiques Semi-définies Positives * on a Class of Positive Semidefinite Biquadratic Forms
Continuing the study of positive semidefinite biquadratic forms on Rm × Rn ([1], [9] and [10]), we characterize those among them that are the sum of squares of bilinear forms.
متن کاملAn Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.
متن کاملSur une classe de formes biquadratiques semi-definies positives
Continuing the study of positive semidefinite biquadratic forms on Rm × Rn ([1], [9] and [10]), we characterize those among them that are the sum of squares of bilinear forms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1207.6372 شماره
صفحات -
تاریخ انتشار 2012